- Title
- Construction techniques for digraphs with minimum diameter
- Creator
- Miller, Mirka; Slamin; Ryan, Joe; Baskoro, Edy Tri
- Relation
- 24th International Workshop on Combinatorial Algorithms (IWOCA 2013). Proceedings of the 24th International Workshop on Combinatorial Algorithms [presented in Combinatorial Algorithms, Vol. 8288] (Rouen, France 10-12 July, 2013) p. 327-336
- Publisher Link
- http://dx.doi.org/10.1007/978-3-642-45278-9_28
- Publisher
- Springer
- Resource Type
- conference paper
- Date
- 2013
- Description
- We consider the so-called order/degree problem, that is, to determine the smallest diameter of a digraph given order and maximum out-degree. There is no general efficient algorithm known for the construction of such optimal digraphs but various construction techniques for digraphs with minimum diameter have been proposed. In this paper, we survey the known techniques.
- Subject
- construction techniques; digraphs; minimum diameter
- Identifier
- http://hdl.handle.net/1959.13/1319164
- Identifier
- uon:23800
- Identifier
- ISBN:9783642452772
- Language
- eng
- Reviewed
- Hits: 1516
- Visitors: 1721
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|